Browsing by Subject "Iterative methods"

Now showing items 1-20 of 54

    • Conference Object  

      Adaptive probabilistic flooding for nanonetworks employing molecular communication 

      Saeed, T.; Lestas, Marios; Pitsillides, Andreas (Institute of Electrical and Electronics Engineers Inc., 2016)
      Probabilistic flooding is a simple to implement, information dissemination scheme which is known to alleviate the broadcast storm problem. Simplicity of implementation is a critical requirement of network protocol design ...
    • Article  

      An Algorithm for Global Maximization of Secrecy Rates in Gaussian MIMO Wiretap Channels 

      Loyka, S.; Charalambous, Charalambos D. (2015)
      Optimal signaling for secrecy rate maximization in Gaussian MIMO wiretap channels is considered. While this channel has attracted a significant attention recently and a number of results have been obtained, including the ...
    • Article  

      Annular liquid jets at high Reynolds numbers 

      Georgiou, Georgios C. (2003)
      The flow of annular liquid jets at high Reynolds numbers is analysed by means of the finite element method and the full-Newton iteration scheme. Results have been obtained for various values of the inner to the outer ...
    • Conference Object  

      Application of artificial neural networks in the prediction of earnings 

      Falas, Tasos; Charitou, Andreas; Charalambous, Chris (IEEE, 1994)
      The feasibility of using artificial neural networks (ANNs) for predicting future earnings by stock market and capital market investors was evaluated. A multilayer perceptron feedforward neural network architecture with an ...
    • Article  

      Block Scheduling of Iterative Algorithms and Graph-Level Priority Scheduling in a Simulated Data-Flow Multiprocessor 

      Evripidou, Paraskevas; Gaudiot, J. -L (1993)
      While data-flow principles permit the utilization of large-scale multiprocessor systems with high programmability and good efficiency, they also introduce much overhead at runtime. In this paper, we have studied an important ...
    • Article  

      Clustering attributed multi-graphs with information ranking 

      Papadopoulos, Antonios I.; Rafailidis, D.; Pallis, George C.; Dikaiakos, Marios D. (2015)
      Attributed multi-graphs are data structures to model realworld networks of objects which have rich properties/attributes and they are connected by multiple types of edges. Clustering attributed multigraphs has several ...
    • Article  

      The complexity of synchronous iterative Do-All with crashes 

      Georgiou, Chryssis; Russell, A.; Shvartsman, A. A. (2004)
      The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to distributed simulation and multi-agent collaboration. ...
    • Article  

      The complexity of synchronous iterative do-all with crashes 

      Georgiou, Chryssis; Russell, A.; Shvartsman, A. A. (2001)
      Do-All is the problem of performing N tasks in a distributed system of P failure-prone processors [8]. Many distributed and parallel algorithms have been developed for this problem and several algorithm simulations have ...
    • Conference Object  

      Control of distributed energy resources for reactive power support 

      Robbins, B. A.; Domínguez-Garcia, A. D.; Hadjicostis, Christoforos N. (2011)
      This paper proposes a method to utilize distributed energy resources (DERs) to provide reactive power support for voltage control in electric power systems. Rather than controlling each of these resources directly, a ...
    • Conference Object  

      Convergence of belief propagation algorithms on binary pairwise Gibbs random fields 

      Le, T.; Hadjicostis, Christoforos N. (2011)
      In this paper, we study the convergence of belief propagation algorithms (BPAs) on binary pairwise Gibbs random fields (BP-GRFs). Exploiting the equivalence of BPA on the graph associated with BP-GRF and the corresponding ...
    • Conference Object  

      Decentralized optimal dispatch of distributed energy resources 

      Domínguez-Garcia, A. D.; Cady, S. T.; Hadjicostis, Christoforos N. (2012)
      In this paper, we address the problem of optimally dispatching a set of distributed energy resources (DERs) without relying on a centralized decision maker. We consider a scenario where each DER can provide a certain ...
    • Conference Object  

      Detection of cell nuclei in breast biopsies using receptive fields 

      Schnorrenberg, F.; Pattichis, Constantinos S.; Kyriacou, Kyriacos C.; Schizas, Christos N. (IEEE, 1994)
      A biopsy analysis support system, called BASS, is introduced. The system uses an unsupervised object detection loop involving center-surround receptive fields, and a nonlinearity to mark the location of cell nuclei in an ...
    • Conference Object  

      Development of an efficient two-phase 3D numerical wave flume 

      Frantzis, C.; Grigoriadis, D. G. E. (Society of Petroleum Engineers, 2017)
      In the present study an efficient two-phase 3D numerical wave flume was developed, tested and validated. The most important advantage over conventional numerical wave flumes is the use of a constant coefficient Poisson ...
    • Article  

      Distributed Balancing of Commodity Networks Under Flow Interval Constraints 

      Hadjicostis, Christoforos N.; Domínguez-Garcia, A. D. (2018)
      We consider networks the nodes of which are interconnected via directed edges, each able to admit a flow (or weight) within a certain interval, with nonnegative end points that correspond to lower and upper flow limits. ...
    • Conference Object  

      Distributed balancing under interval flow constraints in directed communication topologies 

      Hadjicostis, Christoforos N.; Domínguez-Garcia, A. D. (Institute of Electrical and Electronics Engineers Inc., 2018)
      In this paper, we propose a distributed algorithm that relies on a strongly connected (but possibly directed) communication topology to achieve admissible and balanced flows in a given network. More specifically, we consider ...
    • Conference Object  

      Distributed consensus and linear functional calculation in networks: An observability perspective 

      Sundaram, S.; Hadjicostis, Christoforos N. (2007)
      We study the problem of performing sensor fusion and distributed consensus in networks, where the objective is to calculate some linear function of the initial sensor values at some or all of the sensors. We utilize a ...
    • Article  

      Distributed cycle detection and removal 

      Oliva, G.; Setola, R.; Glielmo, L.; Hadjicostis, Christoforos N. (2018)
      In this paper, we provide distributed algorithms to detect and remove cycles in a directed relational graph by exploiting the underlying undirected communication graph; the relational graph models a relation among the ...
    • Conference Object  

      Distributed formation of balanced and bistochastic weighted digraphs in multi-agent systems 

      Charalambous, T.; Hadjicostis, Christoforos N. (2013)
      We propose two distributed algorithms, one for solving the weight-balance problem and another for solving the bistochastic matrix formation problem, in a distributed system whose components (nodes) can exchange information ...
    • Article  

      A distributed generation control architecture for islanded ac microgrids 

      Cady, S. T.; Domínguez-Garcia, A. D.; Hadjicostis, Christoforos N. (2015)
      In this paper, we propose a distributed architecture for generation control in islanded ac microgrids with both synchronous generators and inverter-interfaced power supplies. Although they are smaller and have lower ratings, ...
    • Article  

      Distributed matrix scaling and application to average consensus in directed graphs 

      Domínguez-Garcia, A. D.; Hadjicostis, Christoforos N. (2013)
      We propose a class of distributed iterative algorithms that enable the asymptotic scaling of a primitive column stochastic matrix, with a given sparsity structure, to a doubly stochastic form. We also demonstrate the ...